Econ 1: Spring 2016: U.C. Berkeley Problem Set 7: Monetary Policy Due AprilMonetary Policy and Inflation: Use our standard Keynesian macroeconomic model: • Y = E = C + I + NX + G — GDP equals the sum of co

Source URL: delong.typepad.com

• Keynesian economics
• Interest rates
• Fiscal policy
• Public finance
• Inflation
• Real interest rate
• Fiscal multiplier
• Macroeconomics
• Nominal interest rate
• Monetary policy
• Unemployment
• Multiplier

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3

Source URL: courses.csail.mit.edu

• Sorting algorithms
• Heap
• Binary heap
• D-ary heap
• Merge sort
• Master theorem
• Sort
• Shadow heap
• Soft heap

Ec721 PROBLEM SET 1 1. Consider the Eswaran-Kotwal model of farming households in an economy with a smooth, strictly concave CRS production function f (h, n) of land and labor used in cultivation, and a utility function

Source URL: people.bu.edu

• Capital
• Social inequality
• Distribution of wealth
• Economic globalization
• Economic inequality
• Income distribution
• Financial capital
• Wealth

MCS 441 – Theory of Computation I Spring 2016 Problem Set 5∗ Lev Reyzin Due: at the beginning of class

Source URL: homepages.math.uic.edu

• Complexity classes
• P versus NP problem
• NP
• IP
• P-complete

EC 717a, PROBLEM SET NOA monopolist wishes to sell a good produced at constant unit cost c ∈ (0, 1) to a large population of consumers with heterogenous preferences: a consumer of type θ has a payoff θ log(q +

Source URL: people.bu.edu

CS2101 Due: Monday 3-rd of November 2014 Problem Set 2 CS2101

Source URL: www.csd.uwo.ca

• Sorting algorithms
• Merge sort
• Algorithm
• Vector space
• Flow
• Matrix

Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Source URL: www.levreyzin.com

• NP-complete problems
• Clique problem
• Vertex cover
• Clique
• Independent set
• Bipartite graph
• Travelling salesman problem
• Graph coloring
• Line graph
• Treewidth
• Pathwidth

Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´

Source URL: www.daviddelaat.nl

• Operations research
• Discrete geometry
• NP-complete problems
• Conjectures
• Circle packing
• Sphere packing
• Independent set
• Kepler conjecture
• Tammes problem
• Mathematical optimization
• Semidefinite programming
• FranklRdl graph

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Source URL: theory.stanford.edu

• NP-complete problems
• Computational complexity theory
• Analysis of algorithms
• Operations research
• NP-hard problems
• Vertex cover
• Travelling salesman problem
• Dynamic programming
• Parameterized complexity
• Independent set
• Algorithm
• 2-satisfiability

Math Rumble – Problem Set – Solutions American Mathematics Competitions April 23–25, Each even counting number, beginning with 2, is one more than the preceeding odd counting number. Therefore the differenc

Source URL: sigmaa.maa.org

• Mathematics competitions
• American Motors
• Chrysler
• American Mathematics Competitions
• Potato